Classically Time-Controlled Quantum Automata: Definition and Properties

In this paper we introduce classically time-controlled quantum automata or CTQA, which is a reasonable modification of Moore-Crutchfield finite that uses time-dependent evolution and scheduler defining how long each Hamiltonian will run. Surprisingly enough, provides significant change in the computational power with respect to discrete model. Indeed, show if not computationally restricted, then CTQA can decide Halting problem. order unearth capabilities CTQAs study case restricted scheduler. particular showed depending on type restriction imposed scheduler, (i) recognize non-regular languages cut-point, even presence Karp-Lipton advice, (ii) bounded-error. Furthermore, closure concatenation union by introducing new model rotating tape head. presents itself as computation different approach formal classical control, data schemes computing.